Locally trivial categories and unambiguous concatenation

Locally trivial W∗-bundles

Unambiguous Computations and Locally Definable Acceptance Types

Hertrampf’s locally definable acceptance types show that many complexity classes can be defined in terms of polynomial time bounded NTM’s with simple local conditions on the nodes of its computation tree, rather than global concepts like number of accepting paths etc. We introduce a modification of Hertrampf’s locally definable acceptance types which allows to get a larger number of characteriz...

Unambiguous Computations and Locally Deenable Acceptance Types

Hertrampf's locally de nable acceptance types show that many complexity classes can be de ned in terms of polynomial time bounded NTM's with simple local conditions on the nodes of its computation tree, rather than global concepts like number of accepting paths etc. We introduce a modi cation of Hertrampf's locally de nable acceptance types which allows to get a larger number of characterizable...

Locally finite triangulated categories ✩

A k-linear triangulated category A is called locally finite provided ∑ X∈indA dimk HomA(X,Y ) < ∞ for any indecomposable object Y in A. It has Auslander–Reiten triangles. In this paper, we show that if a (connected) triangulated category has Auslander–Reiten triangles and contains loops, then its Auslander–Reiten quiver is of the form L̂n: · · · · ̂ n n− 1 2 1 By using this, we prove that the Aus...

Locally Connected Recursion Categories

A recursion category is locally connected if connected domains are jointly epimorphic. New proofs of the existence of non-complemented and recursively inseparable domains are given in a locally connected category. The use of local connectedness to produce categorical analogs of undecidable problems is new; the approach allows us to relax the hypotheses under which the results were originally pr...